Computing functions with parallel queries to NP
نویسندگان
چکیده
منابع مشابه
Computing Functions with Parallel Queries to NP
The class p 2 of languages polynomial-time truth-table reducible to sets in NP has a wide range of diierent characterizations. We consider several functional versions of p 2 based on these characterizations. We show that in this way the three function classes FL NP log , FP NP log , and FP NP k are obtained. In contrast to the language case the function classes seem to all be diierent. We give ...
متن کاملOn Functions Computable with Nonadaptive Queries to NP
We study FP NP k , the class of functions that can be computed with nonadaptive queries to an NP oracle. We show that optimization problems stemming from the known NP complete sets, where the optimum is taken over a polynomially bounded range, are hard for FP NP k. This is related to (and, in some sense, extends) work of Chen and Toda CT91]. In addition, it turns out that these optimization pro...
متن کاملSparse Sets, Approximable Sets, and Parallel Queries to NP
We show that if an NP-complete set or a coNP-complete set is polynomial-time disjunc-tive truth-table reducible to a sparse set then FP NP jj = FP NP log]. With a similar argument we show also that if SAT is O(log n)-approximable then FP NP jj = FP NP log]. Since FP NP jj = FP NP log] implies that SAT is O(logn)-approximable BFT97], it follows from our result that the two hypotheses are equival...
متن کاملTen Thousand SQLs: Parallel Keyword Queries Computing
Keyword search in relational databases has been extensively studied. Given a relational database, a keyword query finds a set of interconnected tuple structures connected by foreign key references. On rdbms, a keyword query is processed in two steps, namely, candidate networks (CNs) generation and CNs evaluation, where a CN is an sql. In common, a keyword query needs to be processed using over ...
متن کاملModulo Information from Nonadaptive Queries to NP
The classes of languages accepted by nondeterministic polynomial-time Turing machines (NP machines, in short) that have restricted access to an NP oracle|the machines can ask k queries to the NP oracle and the answer they receive is the number of queries in the oracle language modulo a number m 2|are considered. It was shown in HT95] that these classes coincide with an appropriate level of the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1995
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00080-3